Nominal linkers in Iranian languages: An introduction
نویسندگان
چکیده
In some languages, a noun is linked to of its modifiers and complements via linking element. The cross-linguistic variation that observed with respect the properties functions nominal linkers has made their study an excellent area research contributing both theory typology linkers, more broadly, nominals. Despite importance however, collection solely focuses on this phenomenon been noticeably absent in literature. use prevalent feature many Iranian languages. volume, we provide description wide range patterns eleven delving into intriguing behaviour such elements interaction other morphosyntactic markers. papers volume are result conducted under “The Syntax Nominal Linkers” project at University Toronto, funded by Social Sciences Humanities Research Council Canada (SSHRC) Insight Grant (#435-2018-0527). To our knowledge, first kind dedicated entirely single linguistics. We hope serves as valuable resource for readers, including researchers interested modification, structures general, well language instructors
منابع مشابه
Towards Nominal Formal Languages
We introduce formal languages over infinite alphabets where words may contain binders. We define the notions of nominal language, nominal monoid, and nominal regular expressions. Moreover, we extend history-dependent automata (HD-automata) by adding stack, and study the recognisability of nominal languages.
متن کاملNominal juxtaposition in Australian languages: An LFG analysis
It is well known that Australian languages make heavy use of nominal juxtaposition in a wide variety of functions, but there is little discussion in the theoretical literature of how such juxtapositions should be analysed. We discuss a range of data from Australian languages illustrating how multiple nominals share a single grammatical function within the clause. We argue that such construction...
متن کاملOn Nominal Regular Languages with Binders
We investigate regular languages on infinite alphabets where words may contain binders on names. To this end, classical regular expressions and automata are extended with binders. We prove the equivalence between finite automata on binders and regular expressions with binders and investigate closure properties and complementation of regular languages with binders.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Toronto working papers in linguistics
سال: 2023
ISSN: ['1718-3510']
DOI: https://doi.org/10.33137/twpl.v45i1.41769